The contraction-proximal point algorithm with square-summable errors
نویسندگان
چکیده
منابع مشابه
A proximal point algorithm converging strongly for general errors
In this paper a proximal point algorithm (PPA) for maximal monotone operators with appropriate regularization parameters is considered. A strong convergence result for PPA is stated and proved under the general condition that the error sequence tends to zero in norm. Note that R.T. Rockafellar (1976) assumed summability for the error sequence to derive weak convergence of PPA in its initial for...
متن کاملOn the contraction-proximal point algorithms with multi-parameters
In this paper we consider the contraction-proximal point algorithm: xn+1 = αnu+λnxn+γnJβnxn, where Jβn denotes the resolvent of a monotone operator A. Under the assumption that limn αn = 0, ∑ n αn = ∞, lim infn βn > 0, and lim infn γn > 0, we prove the strong convergence of the iterates as well as its inexact version. As a result we improve and recover some recent results by Boikanyo and Morosa...
متن کاملFinite termination of the proximal point algorithm
where q~ is a c losed, convex func t ion def ined on R n, having values in ~ and S is a c losed, convex set in ~n. We write S for the op t ima l so lu t ion set o f (1), S : = arg minxes cb(x) and assume this set to be non-empty , in o rde r tha t a p ro jec t ion o p e r a t i o n on to this set is well def ined. In o rde r to s impl i fy our analysis , let us define , b ~ ( x ) := ¢~(x )+~, (...
متن کاملW-convergence of the proximal point algorithm in complete CAT(0) metric spaces
In this paper, we generalize the proximal point algorithm to complete CAT(0) spaces and show that the sequence generated by the proximal point algorithm $w$-converges to a zero of the maximal monotone operator. Also, we prove that if $f: Xrightarrow ]-infty, +infty]$ is a proper, convex and lower semicontinuous function on the complete CAT(0) space $X$, then the proximal...
متن کاملOn relaxed and contraction-proximal point algorithms in hilbert spaces
We consider the relaxed and contraction-proximal point algorithms in Hilbert spaces. Some conditions on the parameters for guaranteeing the convergence of the algorithm are relaxed or removed. As a result, we extend some recent results of Ceng-Wu-Yao and Noor-Yao.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fixed Point Theory and Applications
سال: 2013
ISSN: 1687-1812
DOI: 10.1186/1687-1812-2013-93